A core language for rewriting

Algebraic Matching of Vulnerabilities in a Low-Level Code

This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...

Handling owl:sameAs in RDFox via Rewriting

RDFox is a scalable, centralised, main-memory, multi-core RDF system that supports materialisation-based reasoning in OWL 2 RL and SWRL. Reasoning with the owl:sameAs property using the OWL 2 RL/RDF rules can be very inefficient, so in this paper we extend RDFox to handle owl:sameAs via rewriting—replacing equal resources with a single representative. The main challenge in applying this well-kn...

A Core Language for Graph Transformation ( Extended Abstra t )

Extensible Grammars for Language Specialization

A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expressions, etc., and a small, simple core language. We address this dilemma by proposing extensible grammars, a syntax-definition formalism for incremental language extensions and restrictions based on an initial core language...

Graphs for Core Molecular Biology

A graphic language—the graphic κ calculus—modeling protein interactions at the domain level is introduced. Complexation, activation and mixed forms of interaction are expressed as graph rewriting rules. A compilation in a low-level graph rewriting calculus, called mobile κ, is given and shown to be correct up to some suitable notion of observational equivalence. This intermediate language is of...